Constructing Splitting Fields of Polynomials over Local Fields

نویسندگان

  • Jonathan Milstead
  • Sebastian Pauli
  • Brian Sinclair
چکیده

We present an algorithm that finds the splitting field of a polynomial over a local field. Our algorithm is an OM algorithm modified for this task.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On D5-polynomials with integer coefficients

We give a family of D5-polynomials with integer coefficients whose splitting fields over Q are unramified cyclic quintic extensions of quadratic fields. Our polynomials are constructed by using Fibonacci, Lucas numbers and units of certain cyclic quartic fields.

متن کامل

Constructing class fields over local fields par Sebastian Pauli

Let K be a p-adic field. We give an explicit characterization of the abelian extensions ofK of degree p by relating the coefficients of the generating polynomials of extensions L/K of degree p to the exponents of generators of the norm groupNL/K(L). This is applied in an algorithm for the construction of class fields of degree p, which yields an algorithm for the computation of class fields in ...

متن کامل

Constructing class fields over local fields

Let K be a p-adic field. We give an explicit characterization of the abelian extensions of K of degree p by relating the coefficients of the generating polynomials of extensions L/K of degree p to the exponents of generators of the norm group NL/K(L ∗). This is applied in an algorithm for the construction of class fields of degree pm, which yields an algorithm for the computation of class field...

متن کامل

Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics, II

In this note by using Dickson’s theorem we construct families of irreducible polynomials of degree 4nk (k = 1, 2, ...) over a finite field of odd characteristics. Also we apply Q-Transformation and present a new recurrent method for constructing a families of irreducible polynomials of degree 2nk (k = 1, 2, ...) over the finite field of F3s . Mathematics Subject Classification: 12A20

متن کامل

Iterated constructions of irreducible polynomials over finite fields with linearly independent roots

The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible N-polynomials (with linearly independent roots) over finite fields. For a suitably chosen initial N-polynomial F1ðxÞAF2s 1⁄2x of degree n; polynomials FkðxÞAF2s 1⁄2x of degrees 2 n are constructed by iteration of the transformation of variable x-x þ dx ; where dAF2s and da0: It is shown that the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014